A Mixed Approach to Adjoint Computation with Algorithmic Differentiation

نویسندگان

  • Kshitij Kulshreshtha
  • Sri Hari Krishna Narayanan
  • Tim Albring
چکیده

Various algorithmic differentiation tools have been developed and applied to large-scale simulation software for physical phenomena. Until now, two strictly disconnected approaches have been used to implement algorithmic differentiation (AD), namely, source transformation and operator overloading. This separation was motivated by different features of the programming languages such as Fortran and C++. In this work we have for the first time combined the two approaches to implement AD for C++ codes. Source transformation is used for core routines that are repetitive where the transformed source can be optimized much better by modern compilers, and operator overloading is used to interconnect at the upper level, where source transformation is not possible because of complex language constructs of C++. We have also devised a method to apply the mixed approach in the same application semiautomatically. We demonstrate the benefit of using this approach using some real world applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic vs. Algorithmic Differentiation of GSL Integration Routines

Forward and reverse modes of algorithmic differentiation (AD) transform implementations of multivariate vector functions F : IR → IR as computer programs into tangent and adjoint code, respectively. The adjoint mode is of particular interest in large-scale functions due to the independence of its computational cost on the number of free variables. The additional memory requirement for the compu...

متن کامل

A Discrete Adjoint Version of an Unsteady Incompressible Solver for Openfoam Using Algorithmic Differentiation

The comparatively low computational costs of adjoint based gradient methods for optimization problems with a high number of degrees of freedom have allowed them to become one of the most interesting approaches in CFD shape optimization. At the core of such optimization techniques lies the computation of topology sensitivity maps. The two most common approaches for computing adjoint based sensit...

متن کامل

Fast Estimates of Greeks from American Options: A Case Study in Adjoint Algorithmic Differentiation

In this article algorithmic differentiation is applied to compute the sensitivities of the price of an American option, which is computed by the Longstaff-Schwartz algorithm. Adjoint algorithmic differentiation methods speed up the calculation and make the results more accurate and robust compared to a finite difference approximation. However, adjoint computations require more memory due to the...

متن کامل

Discrete Adjoint of a fully-implicit coupled solver based on foam-extend using Algorithmic Differentiation

Adjoint based methods are an effective way to obtain accurate gradients for CFD optimization problems since the computation cost for the calculation of these gradients is relatively independent of the degrees of freedom. At the heart of such an optimization process lies the computation of topology sensitivity maps. Sensitivities are derivatives of an objective function resulting from CFD comput...

متن کامل

Algorithmic Differentiation of Numerical Methods: Second-Order Tangent and Adjoint Solvers for Systems of Parametrized Nonlinear Equations

Forward and reverse modes of algorithmic differentiation (AD) transform implementations of multivariate vector functions F : IR → IR as computer programs into tangent and adjoint code, respectively. The reapplication of the same ideas yields higher derivative code. In particular, second derivatives play an important role in nonlinear programming. Second-order methods based on Newton’s algorithm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015